摘要 :
The energy demand of the consumers have increased considerably in the past few years and this cannot be achieved by using only conventional macrogrids. The best possible solution to this growing demand of uninterrupted power suppl...
展开
The energy demand of the consumers have increased considerably in the past few years and this cannot be achieved by using only conventional macrogrids. The best possible solution to this growing demand of uninterrupted power supply is to use integrated microgrids. The use of microgridsproves to be the most efficient solution for uninterrupted power supply and along with the integration of Renewable Energy Sources (RES), there will be plethora of options for the future energy distributions. This paper mainly focuses on the application of graph theory to find the shortestpath from the fault point to the point of common coupling (PCC) which will ensure continuous power for larger portion of the network and also prevent catastrophic events like blackout from occurring. The algorithms used in this paper are tested and validated on a 69 bus network and detailedcomparison is made with different testing algorithms to get the shortest path in minimum possible time.
收起
摘要 :
This paper presents the HybriD-GM model conception, from modeling to consolidation. The D-GM environment is also extended, providing efficient parallel executions for quantum computing simulations, targeted to hybrid architectures...
展开
This paper presents the HybriD-GM model conception, from modeling to consolidation. The D-GM environment is also extended, providing efficient parallel executions for quantum computing simulations, targeted to hybrid architectures considering the CPU and GPU integration. By managing projection operators over quantum structures, and exploring coalescing memory access patterns, the HybriD-GM model enables granularity control, optimizing hardware resources in distributed computations organized as tree data structures. In the HybriD-GM evaluation, simulations of Shor's and Grover's algorithms achieve significant performance improvements in comparison to the previous D-GM version, and also with other related works, for example, LIQUi|? and ProjectQ simulators.
收起
摘要 :
The arguments given in this paper suggest that Grover’s and Shor’s algorithms are more closely related than one might at first expect. Specifically, we show that Grover’s algorithm can be viewed as a quantum algorithm which sol...
展开
The arguments given in this paper suggest that Grover’s and Shor’s algorithms are more closely related than one might at first expect. Specifically, we show that Grover’s algorithm can be viewed as a quantum algorithm which solves a non-abelian hidden subgroup problem (HSP). But we then go on to show that the standard non-abelian quantum hidden subgroup (QHS) algorithm can not find a solution to this particular HSP. This leaves open the question as to whether or not there is some modification of the standard non-abelian QHS algorithm which is equivalent to Grover’s algorithm.
收起
摘要 :
Quantum computing is currently being researched in many countries, and if implemented in the near future, it may pose a threat to existing encryption standards. In the quantum computer environment, asymmetric encryption can be sol...
展开
Quantum computing is currently being researched in many countries, and if implemented in the near future, it may pose a threat to existing encryption standards. In the quantum computer environment, asymmetric encryption can be solved by Shor's Algorithm in polynomial time, and the difficulty of breaking symmetric encryption using brute force is reduced from N times to square root N times by Grover's Algorithm. We take the Advanced Encryption Standard as the theme and increase the key length from the original standard 192 bits and 256 bits to 384 bits and 512 bits, respectively, in order to maintain the security level of AES 192/256 under the environment of quantum computing, so we propose the key schedule of AES 384/512, and write the software in C++ on FPGA. The experimental results show that our scheme can achieve Level III and Level V security levels in a quantum computer attack environment. In addition to increasing the length of the key, we use the LUT method in the process of writing SubBytes to replace the array and speed up the computation to optimize the execution speed. In addition, the proposed scheme is still based on 128-bit computing blocks, rather than computing blocks in larger blocks.
收起
摘要 :
Microgrids are the solution to the growing power demand of consumers. Renewable Energy System (RES) integration to microgrid causes the power flow to be bidirectional in nature. Reconfiguration of microgrid could occur due to RES,...
展开
Microgrids are the solution to the growing power demand of consumers. Renewable Energy System (RES) integration to microgrid causes the power flow to be bidirectional in nature. Reconfiguration of microgrid could occur due to RES, load or utility grid connection or disconnection. Thusconventional protection strategies are not applicable to microgrids and is hence challenging for protection engineers to clear the fault. This paper proposes hybrid Prims-Johnson’s algorithm, which aids in identifying the shortest path from a faulted point to the point of common coupling.This algorithm ensures that only minimum portion of network is disconnected during fault clearance. The proposed algorithm is tested and validated on a standard 32-bus microgrid network and an IEEE 69-bus distribution network.
收起
摘要 :
The shortest path problem (SPP) is a classic problem and appears in a wide range of applications. Although a variety of algorithms already exist, new advances are still being made, mainly tuned for particular scenarios to have bet...
展开
The shortest path problem (SPP) is a classic problem and appears in a wide range of applications. Although a variety of algorithms already exist, new advances are still being made, mainly tuned for particular scenarios to have better performances. As a result, they become more and more technically complex and sophisticated. In this paper, we developed an intuitive and nature-inspired algorithm to compute all possible shortest paths between two nodes in a graph: Resonance Algorithm (RA). It can handle any undirected, directed, or mixed graphs, irrespective of loops, unweighted or positively weighted edges, and can be implemented in a fully decentralized manner. Although the original motivation for RA is not the speed per se, in certain scenarios (when sophisticated matrix operations can be employed, and when the map is very large and all possible shortest paths are demanded), it out-competes Dijkstra’s algorithm, which suggests that in those scenarios, RA could also be practically useful.
收起
摘要 :
The objective of this paper concerns at first the motivation and the method of Shor’s algorithm including remarks on quantum computing introducing an algorithmic description of the method. The corner stone of the Shor’s algorith...
展开
The objective of this paper concerns at first the motivation and the method of Shor’s algorithm including remarks on quantum computing introducing an algorithmic description of the method. The corner stone of the Shor’s algorithm is the modular exponentiation that is the most computational component (in time and space). A linear depth unit based on phase estimation is introduced and a description of a generic version of a modular multiplier based on phases is introduced to build block of a gates to efficient modular exponentiation circuit. Our proposal includes numerical experiments achieved on both the IBM simulator using the Qiskit library and on quantum physical optimizers provided by IBM. The shor’s algorithm based on phase estimation succeeds in factoring integer numbers with more than 35 digits using circuits with about 100 qubits.
收起
摘要 :
A microgrid can be seen as a controlled cell of the power system within which heat and power are generated for local customers, and generation and load are passively controlled. They are considered to be an important part of the f...
展开
A microgrid can be seen as a controlled cell of the power system within which heat and power are generated for local customers, and generation and load are passively controlled. They are considered to be an important part of the future power systems as they are capable of solving complexproblems in large systems. In case of an emergency for example the instability of the micro grid caused by the faults in the wind power system, a microgrid is then required to reconfigure itself as soon as possible in order to fulfill our basic aim of supplying continuous electricity. Reconfigurationis a controlled measure that includes topology changes, load/generation shedding and other measures to re direct power flow to the remaining unaffected loads in a micro grid. This paper proposes graph algorithm Djikstra’s which aid in identifying the shortest path from a faulted pointto the point of common coupling (PCC). Algorithms like Boruvka’s and Prims algorithms ensure that only minimum portion of the network is disconnected during fault clearance.
收起
摘要 :
We present a simple conversion algorithm which allows to rewrite the two-dimensional Brun Algorithm in terms of the Podsypanin Algorithm. Further, we demonstrate how this conversion process can be used to transfer certain (statist...
展开
We present a simple conversion algorithm which allows to rewrite the two-dimensional Brun Algorithm in terms of the Podsypanin Algorithm. Further, we demonstrate how this conversion process can be used to transfer certain (statistical, approximation) properties from the original to the resulting algorithm.
收起
摘要 :
Microgrid caters to the growing power demand in the distribution network. Due to reconfiguration of microgrid, conventional protection schemes are not suitable for fault clearance. This paper proposes a communication assisted cent...
展开
Microgrid caters to the growing power demand in the distribution network. Due to reconfiguration of microgrid, conventional protection schemes are not suitable for fault clearance. This paper proposes a communication assisted central protection system (CPS), which monitors the microgrid.The active nodes of the network are populated using Bellman Ford algorithm. In the event of fault, the Dijkstras algorithm is employed on the current topology of network, to identify the shortest path from the faulted point to the point of common coupling. This hybrid algorithm ensures thatduring fault clearance, minimum portion of network disconnection occurs. The algorithm is tested and validated on 40-bus and 54-bus microgrid network.
收起
原文获取